A complexity analysis of functional interpretations 1 Mircea-Dan HERNEST a,2 and Ulrich KOHLENBACH b,3 a Laboratoire ´

Source URL: www.mathematik.tu-darmstadt.de

• Logic
• Mathematical logic
• Proof theory
• Abstraction
• Intuitionism
• Constructivism
• Logic in computer science
• Model theory
• Dialectica interpretation
• Intuitionistic logic
• Realizability
• First-order logic

KRDB RESEARCH CENTRE KNOWLEDGE REPRESENTATION MEETS DATABASES Faculty of Computer Science, Free University of Bozen-Bolzano, Piazza Domenicani 3, 39100 Bolzano, Italy Tel: +, fax: +, http://ww

Source URL: www.inf.unibz.it

• Mathematics
• Logic
• Mathematical logic
• Ontology
• Boolean algebra
• Mereology
• Predicate logic
• Algebraic logic
• ZermeloFraenkel set theory
• Binary relation
• Power set
• Mereotopology

Applied Foundations: Proof Mining in Mathematics Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny Munkegade

Source URL: www.mathematik.tu-darmstadt.de

• Logic
• Proof theory
• Mathematical logic
• Mathematics
• Proof mining
• Mathematical proof
• Consistency
• Constructive proof
• Formal proof
• Intuitionistic logic
• Approximation
• Type theory

Learning Programs from Noisy Data Veselin Raychev Pavol Bielik Martin Vechev

Source URL: www.srl.inf.ethz.ch

• Theoretical computer science
• Algorithm
• Mathematical logic
• Machine learning
• Mathematics
• Coding theory
• Exponential mechanism
• Logic
• Philosophy of mathematics

I NTRODUCTION T HE LST FRAMEWORK Iterative forcing and preservation of hyperimmunity

Source URL: ludovicpatey.com

• Computability theory
• Theoretical computer science
• Mathematical logic
• Theory of computation
• Mathematics
• Model theory
• Algorithm characterizations
• operator

COLORING THE RATIONALS IN REVERSE MATHEMATICS EMANUELE FRITTAION AND LUDOVIC PATEY Abstract. Ramsey’s theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In th

Source URL: www.math.tohoku.ac.jp

• Logic in computer science
• Differential forms
• Combinatory logic
• Lambda calculus
• Peano axioms
• Closed and exact differential forms
• Banach fixed-point theorem
• Peetre theorem

The complexity of satisfaction problems in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE

Source URL: ludovicpatey.com

• Logic
• Mathematics
• Constraint programming
• Abstraction
• Model theory
• Boolean satisfiability problem
• Electronic design automation
• Logic in computer science
• Complexity of constraint satisfaction
• Constraint satisfaction problem
• Satisfiability
• Binary relation

Rooter: A Methodology for the Typical Unification of Access Points and Redundancy Jeremy Stribling, Daniel Aguayo and Maxwell Krohn A BSTRACT Many physicists would agree that, had it not been for congestion control, the

Source URL: pdos.csail.mit.edu

• Theoretical computer science
• Mathematics
• Theory of computation
• Computability theory
• Models of computation
• Mathematical logic
• Formal methods
• Algorithm
• Turing machine
• Randomized algorithm
• IP
• Alan Turing

A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott Aaronson

Source URL: www.scottaaronson.com

• Mathematics
• Theoretical computer science
• Computability theory
• Mathematical logic
• Theory of computation
• Turing machine
• Models of computation
• Busy beaver
• Halting problem
• ZermeloFraenkel set theory
• Computability
• Computable function

Contextuality, Cohomology and Paradox Samson Abramsky Joint work with Rui Soares Barbosa, Kohei Kishida, Ray Lal and Shane Mansfield Department of Computer Science, University of Oxford

Source URL: logic.berkeley.edu.